First-Improvement vs. Best-Improvement Local Optima Networks of NK Landscapes
نویسندگان
چکیده
This paper extends a recently proposed model for combinatorial landscapes: Local Optima Networks (LON), to incorporate a first-improvement (greedyascent) hill-climbing algorithm, instead of a best-improvement (steepest-ascent) one, for the definition and extraction of the basins of attraction of the landscape optima. A statistical analysis comparing best and first improvement network models for a set of NK landscapes, is presented and discussed. Our results suggest structural differences between the two models with respect to both the network connectivity, and the nature of the basins of attraction. The impact of these differences in the behavior of search heuristics based on first and best improvement local search is thoroughly discussed.
منابع مشابه
On the Attainability of NK Landscapes Global Optima
In this paper, we aim at evaluating the impact of the starting point of a basic local search based on the first improvement strategy. We define the coverage rate of a configuration as the proportion of the search space from which a particular configuration can be reached by a strict hill-climbling with a non-zero probability. In particular, we compute the coverage rate of fitness landscapes glo...
متن کاملHill-Climbing Behavior on Quantized NK-Landscapes
This paper provides guidelines to design climbers considering a landscape shape under study. In particular, we aim at competing best improvement and first improvement strategies, as well as evaluating the behavior of different neutral move policies. Some conclusions are assessed by an empirical analysis on non-neutral (NK-) and neutral (quantized NK-) landscapes. Experiments show the ability of...
متن کاملAn Analysis of N\!K Landscapes: Interaction Structure, Statistical Properties, and Expected Number of Local Optima
Simulated landscapes have been used for decades to evaluate search strategies whose goal is to find the landscape location with maximum fitness. Understanding properties of landscapes is important for understanding search difficulty. This paper presents a novel and transparent characterization of NK landscapes and derives an analytic expression representing the expected number of local optima. ...
متن کاملCoarse-Grained Barrier Trees of Fitness Landscapes
Recent literature suggests that local optima in fitness landscapes are clustered, which offers an explanation of why perturbationbased metaheuristics often fail to find the global optimum: they become trapped in a sub-optimal cluster. We introduce a method to extract and visualize the global organization of these clusters in form of a barrier tree. Barrier trees have been used to visualize the ...
متن کاملLocal Optima Networks: A New Model of Combinatorial Fitness Landscapes
This chapter overviews a recently introduced network-based model of combinatorial landscapes: Local Optima Networks (LON). The model compresses the information given by the whole search space into a smaller mathematical object that is a graph having as vertices the local optima and as edges the possible weighted transitions between them. Two definitions of edges have been proposed: basin-transi...
متن کامل